Convergence Analysis of Hidden Genes Genetic Algorithms in Space Trajectory Optimization
نویسندگان
چکیده
منابع مشابه
Convergence Analysis of Optimization Algorithms
The regret bound of an optimization algorithms is one of the basic criteria for evaluating the performance of the given algorithm. By inspecting the differences between the regret bounds of traditional algorithms and adaptive one, we provide a guide for choosing an optimizer with respect to the given data set and the loss function. For analysis, we assume that the loss function is convex and it...
متن کاملSyntactic Analysis of Convergence in Genetic Algorithms
We use the average hamming distance of a population as a syntactic metric to obtain probabilistic bounds on the time convergence of genetic algorithms. Analysis of a at function provides worst case time complexity for static functions and gives a theoretical basis to the problem of premature convergence. We suggest simple changes that mitigate this problem and help ght deception. Further, emplo...
متن کاملOn Testing Global Optimization Algorithms for Space Trajectory Design
In this paper we discuss the procedures to test a global search algorithm applied to a space trajectory design problem. Then, we present some performance indexes that can be used to evaluate the effectiveness of global optimization algorithms. The performance indexes are then compared highlighting the actual significance of each one of them. A number of global optimization algorithms are tested...
متن کاملConvergence analysis of canonical genetic algorithms
This paper analyzes the convergence properties of the canonical genetic algorithm (CGA) with mutation, crossover and proportional reproduction applied to static optimization problems. It is proved by means of homogeneous finite Markov chain analysis that a CGA will never converge to the global optimum regardless of the initialization, crossover, operator and objective function. But variants of ...
متن کاملQuery Optimization Using Genetic Algorithms in the Vector Space Model
In information retrieval research; Genetic Algorithms (GA) can be used to find global solutions in many difficult problems. This study used different similarity measures (Dice, Inner Product) in the VSM, for each similarity measure we compared ten different GA approaches based on different fitness functions, different mutations and different crossover strategies to find the best strategy and fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Aerospace Information Systems
سال: 2018
ISSN: 2327-3097
DOI: 10.2514/1.i010564